import java.util.List;

public class Test {

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
//        System.out.println("-----------");

        binaryTree.preOrder(root);
        System.out.println();





//        List<BinaryTree.TreeNode> list = binaryTree.preOrder2(root);
//        for(int i = 0;i<list.size();i++){
//            System.out.print(list.get(i).val+" ");
//        }
//        System.out.println();
//
//        binaryTree.levleOrder(root);

//        System.out.println(binaryTree.isCompleteTree(root));

//        System.out.println(binaryTree.nodeSize(root));
//        System.out.println(binaryTree.nodeSize1(root));

//        binaryTree.getLeafSize(root);
//        System.out.println(binaryTree.leafSize);
//
//        System.out.println(binaryTree.getLeafSize2(root));
//
//        System.out.println(binaryTree.height(root));
//
//        System.out.println(binaryTree.find(root,'B'));


//        binaryTree.inOrder(root);
//        System.out.println();
//        binaryTree.postOrder(root);
    }
}
